Cluster Pruning: An Efficient Filter Pruning Method for Edge AI Vision Applications
نویسندگان
چکیده
منابع مشابه
An Efficient Pruning Method to Process Reverse Skyline Queries
Several algorithms for processing reverse skyline queries have been proposed in recent literature. However, these algorithms are based on pre-processing approaches, and hence involve complex procedures and waste storage space due to inefficient use of storage. In addition, they are not robust to frequently changing data as, they have to re-compute and update the pre-computed results. To overcom...
متن کاملPruning Filters for Efficient ConvNets
Convolutional Neural Networks (CNNs) are extensively used in image and video recognition, natural language processing and other machine learning applications. The success of CNNs in these areas corresponds with a significant increase in the number of parameters and computation costs. Recent approaches towards reducing these overheads involve pruning and compressing the weights of various layers...
متن کاملPruning nearest neighbor cluster trees
Nearest neighbor (k-NN) graphs are widely used in machine learning and data mining applications, and our aim is to better understand what they reveal about the cluster structure of the unknown underlying distribution of points. Moreover, is it possible to identify spurious structures that might arise due to sampling variability? Our first contribution is a statistical analysis that reveals how ...
متن کاملEfficient Pruning Method for Ensemble Self-Generating Neural Networks
Recently, multiple classifier systems (MCS) have been used for practical applications to improve classification accuracy. Self-generating neural networks (SGNN) are one of the suitable base-classifiers for MCS because of their simple setting and fast learning. However, the computation cost of the MCS increases in proportion to the number of SGNN. In this paper, we propose an efficient pruning m...
متن کاملPruning bayesian networks for efficient computation
I I I I I I I I I I I I I I 1 Abstract This paper analyzes the circumstances under which Bayesian networks can be pruned in order to reduce computational complexity without altering the computation for variables of interest. Given a problem instance which consists of a query and evidence for a set nf nodes in the network, it is possible to delete portions of the network which do not participate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2020
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2020.2971418